Compressing Data Cube in Parallel OLAP Systems
نویسندگان
چکیده
منابع مشابه
Compressing Data Cube in Parallel OLAP Systems
This paper proposes an efficient algorithm to compress the cubes in the progress of the parallel data cube generation. This low overhead compression mechanism provides block-by-block and record-by-record compression by using tuple difference coding techniques, thereby maximizing the compression ratio and minimizing the decompression penalty at run-time. The experimental results demonstrate that...
متن کاملOLAP Cube Visualization of Environmental Data Catalogs
Systems like SciScope and Data Access System for Hydrology (DASH) rely on data catalogs to facilitate data discovery. These catalogs describe several nation-wide data repositories that are important for scientists including US Geological Survey’s National Water Information System (NWIS), Environmental Protection Agency’s STOrage and RETrieval System (EPA STORET) and National Climatic Data Cente...
متن کاملOLAP Cube-based Graph Approach for Bibliographic Data
There is a growing number of different research fields that are concerned with bibliographic data analysis. In many cases, data of interest can be described as heterogeneous information networks. To explore knowledge from that networks in a multidimensinal way, OLAP (Online Analytical Processing) analysis helps users to access data from different points of views. The ability of OLAP for analyzi...
متن کاملParallel Data Loader and OLAP Operations
Constructing fact tables and performing OLAP operations are some of the most essential but expensive operations in data warehousing. OLAP operations require aggregation on many combinations of each dimension attribute. As the number of dimensions increase, it becomes very expensive to compute summary data cubes because the cost of required computations grows exponentially with the increase of n...
متن کاملCompressing cube-connected cycles and butterfly networks
We consider the simulation of large cube-connected cycles (CCC) and large butterry networks (BFN) on smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a xed size. We show that large CCC's and BFN's can be embedded into smaller networks of the same type with (a) dilation 2 and optimum load, (b) dila...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science Journal
سال: 2007
ISSN: 1683-1470
DOI: 10.2481/dsj.6.s184